Common Subsumbers in RDF
نویسندگان
چکیده
Since their definition in 1992, Least Common Subsumers (LCSs) have been identified as services supporting learning by examples. Nowadays, the Web of Data offers a hypothetically unlimited dataset of interlinked and machine-understandable examples modeled as RDF resources. Such an open and continuously evolving information source is then really worth investigation to learn significant facts. In order to support such a process, in this paper we give up to the subsumption minimality requirement of LCSs to meet the peculiarities of the dataset at hand and define Common Subsumers (CSs). We also propose an anytime algorithm to find CSs of pairs of RDF resources, according to a selection of such resources, which ensures computability.
منابع مشابه
RDF Production from Municipal Wastes (Case Study: Babol City)
Today, with the advancement of technology, turning waste into fuel has been considered as an inexhaustible source of energy production, especially in industries with high energy consumption. The most important of these industries are Cement and Iron Smelting factories. Babol, as one of the largest provinces in the north of the country, has been facing waste management crisis for several years w...
متن کاملEvaluating of Refuse Derived Fuel (RDF) Production from Municipal Solid Waste (Case Study: Qazvin Province)
Considering increasing population growth in recent decades, and consequently, the increase in waste production in the world, waste management and efforts to reduce their harm to the environment has become an important issue. One of the appropriate ways to manage municipal waste is to generate energy from waste, especially by RDF production method. On the other hand, in order to reduce the consu...
متن کاملCommon Logic for an RDF Store
The advent of commercial tools that support reasoning and management of RDF data stores provides a robust base for the growth of Semantic Web applications. There is as yet no analogous set of tools and products to support advanced logic-based applications. This article examines issues that arise when seeking to combine the expressive power of Common Logic with the scalability of an RDF store. I...
متن کاملEnabling Semantic Web Programming by Integrating RDF and Common Lisp
This paper introduces “Wilbur”, an RDF and DAML toolkit implemented in Common Lisp. Wilbur exposes the RDF data model as a frame-based representation system; an object-oriented view of frames is adopted, and RDF data is integrated with the host language by addressing issues of input/output, data structure compatibility, and error signaling. Through seamless integration we have achieved a progra...
متن کاملA Name Resolution Mechanism for the RDF Model
This paper describes a name resolution mechanism suitable for loosely coupled applications without a central authority a scenario we expect for many RDF applications where clouds of federated information progressively merge into a bigger cloud. The mechanism is based on Internet standards and it extends the basic name resolution mechanism with functions suitable for management of resources and ...
متن کامل